-
1 deterministic finite-state automaton
Техника: детерминированный конечный автоматУниверсальный англо-русский словарь > deterministic finite-state automaton
-
2 automaton
автомат
– combinatorial automaton
– commutative automaton
– definite automaton
– deterministic automaton
– digital automaton
– finite automaton
– finite-memory automaton
– finite-state automaton
– fixed automaton
– growing automaton
– higher automaton
– input-restricted automaton
– Mealy automaton
– memoryless automaton
– Moore automaton
– noninitial automaton
– probabilistic automaton
– redundant automaton
– self-adaptive automaton
– self-moving automaton
– stochastic automaton
– trivial automaton
-
3 automaton
- anthropomorphic automaton
- asynchronous automaton
- canonical automaton
- cellular automaton
- completely specified automaton
- deterministic automaton
- digital automaton
- discrete automaton
- finite automaton
- finite-state automaton
- fuzzy automaton
- heuristic automaton
- indeterministic automaton
- infinite automaton
- infinite-state automaton
- iterative automaton
- learned automaton
- learning automaton
- linear automaton
- nested automaton
- nonuniform automaton
- piecewise linear automaton
- primary automaton
- probabilistic automaton
- reducible automaton
- redundant automaton
- register automaton
- secondary automaton
- self-adapting automaton
- self-adjusting automaton
- self-reproducing automaton
- stochastic automaton
- symplectic cellular automaton
- synchronous automaton
- tesselation automaton
- uniform automaton -
4 automaton
- anthropomorphic automaton
- asynchronous automaton
- canonical automaton
- cellular automaton
- completely specified automaton
- deterministic automaton
- digital automaton
- discrete automaton
- finite automaton
- finite-state automaton
- fuzzy automaton
- heuristic automaton
- indeterministic automaton
- infinite automaton
- infinite-state automaton
- iterative automaton
- learned automaton
- learning automaton
- linear automaton
- nested automaton
- nonuniform automaton
- piecewise linear automaton
- primary automaton
- probabilistic automaton
- reducible automaton
- redundant automaton
- register automaton
- secondary automaton
- self-adapting automaton
- self-adjusting automaton
- self-reproducing automaton
- stochastic automaton
- symplectic cellular automaton
- synchronous automaton
- tesselation automaton
- uniform automatonThe New English-Russian Dictionary of Radio-electronics > automaton
-
5 automaton
- anthropomorphic automaton
- canonical parsing automaton
- cellular automaton
- completely specified automaton
- deterministic automaton
- digital automaton
- discrete automaton
- finite automaton
- finite state automaton
- finite-memory automaton
- halting automaton
- infinite automaton
- linear-bounded automaton
- Mealy automaton
- Moore automaton
- nondeterministic automaton
- parsing automaton
- partialy specific automaton
- probabilistic automaton
- push-down automaton
- reduced automaton
- reduced-time automaton
- redundant automaton
- self-adjusting automaton
- self-reproducing automaton
- semireduced parsing automaton
- split parsing automaton
- stochastic automaton
- timed automaton
- two-way automatonEnglish-Russian dictionary of computer science and programming > automaton
-
6 DFA
1) Общая лексика: Фонд Развития Стран Африки (Development Fund for Africa)2) Компьютерная техника: Definite Finite Automata, Deterministic Finite Automata, Direct File Access, Disk First Aid3) Авиация: delayed flaps approach4) Медицина: direct fluorescent antibody5) Американизм: Department Of Finance And Administration6) Военный термин: Death From Above, Defence Facilities Agreement, Dynamic Force Analysis, designated field activity, direction finding antenna7) Техника: damage function analysis, describing function analyzer, digital fault analysis, digital frequency analyzer, disk file address, driver fuel assembly, dummy fuel assembly8) Грубое выражение: Damned Funny Architecture9) Сокращение: Dairy Farmers Association, Doctor of Fine Arts, Department of Foreign Affairs (Департамент иностранных дел (Филиппины))10) Вычислительная техника: Differential Fault Analysis, deterministic finite-state automaton, deterministic finite automaton11) Деловая лексика: Development Facilitation Act12) Автоматика: design for assembly13) Нефть и газ: (сокр. от) Downhole Gluid Analyzer = скважинный анализатор флюидов, внутрискважинный анализатор флюидов, забойный анализатор флюидов ( входит в состав пластоиспытателя на кабеле)14) Общественная организация: Democracy For America15) Правительство: Dog Friendly Area16) Оргтехника: Document Finishing Architecture -
7 DFA
1. damage function analysis - анализ функции повреждения;2. describing function analyzer - анализатор функции описания;3. design for assembly - проектирование сборки; проектирование тепловыделяющей сборки;4. deterministic finite-state automaton - детерминированный конечный автомат; ДКА;5. digital fault analysis - анализ отказов цифровых схем;6. digital frequency analyzer - цифровой анализатор частот;7. direction finding antenna - радиопеленгаторная антенна, антенна радиопеленгатора;8. disk file address - адрес файла на диске;9. driver fuel assembly - запальная топливная сборка;10. dummy fuel assembly - имитатор тепловыделяющего элемента -
8 DFA
сокр. от deterministic finite-state automatonдетерминированный конечный автомат, ДКАEnglish-Russian dictionary of computer science and programming > DFA
См. также в других словарях:
Deterministic finite-state machine — An example of a Deterministic Finite Automaton that accepts only binary numbers that are multiples of 3. The state S0 is both the start state and an accept state. In the theory of computation and automata theory, a deterministic finite state… … Wikipedia
Finite-state machine — State machine redirects here. For infinite state machines, see State transition system. For fault tolerance methodology, see State machine replication. SFSM redirects here. For the Italian railway company, see Circumvesuviana. A finite state… … Wikipedia
Finite state machine — A finite state machine (FSM) or finite state automaton (plural: automata ) or simply a state machine, is a model of behavior composed of a finite number of states, transitions between those states, and actions. A finite state machine is an… … Wikipedia
Finite state transducer — A finite state transducer (FST) is a finite state machine with two tapes: an input tape and an output tape. This contrasts with an ordinary finite state automaton (or finite state acceptor), which has a single tape. OverviewAn automaton can be… … Wikipedia
Nondeterministic finite-state machine — In the theory of computation, a nondeterministic finite state machine or nondeterministic finite automaton (NFA) is a finite state machine where for each pair of state and input symbol there may be several possible next states. This distinguishes … Wikipedia
Nondeterministic finite state machine — In the theory of computation, a nondeterministic finite state machine or nondeterministic finite automaton (NFA) is a finite state machine where for each pair of state and input symbol there may be several possible next states. This distinguishes … Wikipedia
Deterministic automaton — is a concept of automata theory in which the outcome of a transition from one state to another given a certain input can be predicted for every occurrence. A common deterministic automaton is a deterministic finite state machine (sometimes… … Wikipedia
Two-way deterministic finite automaton — In computer science, a two way deterministic finite automaton (2DFA) is an abstract machine, a generalized version of the deterministic finite automaton (DFA) which can revisit characters already processed. As in a DFA, there are a finite number… … Wikipedia
Deterministic pushdown automaton — In automata theory, a pushdown automaton is a finite automaton with an additional stack of symbols; its transitions can take the top symbol on the stack and depend on its value, and they can add new top symbols to the stack. A deterministic… … Wikipedia
State transition table — In automata theory and sequential logic, a state transition table is a table showing what state (or states in the case of a nondeterministic finite automaton) a finite semiautomaton or finite state machine will move to, based on the current state … Wikipedia
Deterministic algorithm — In computer science, a deterministic algorithm is an algorithm which, in informal terms, behaves predictably. Given a particular input, it will always produce the same output, and the underlying machine will always pass through the same sequence… … Wikipedia